搜索资源列表
snlying6
- 1、 学会针对DFA转换图实现相应的高级语言源程序。 2、 深刻领会状态转换图的含义,逐步理解有限自动机。 3、 掌握手工生成词法分析器的方法,了解词法分析器的内部工作原理 -1, the Institute against DFA conversion map corresponding high-level language source. 2, deeply understand the state transition map meaning, and graduall
6611333
- 有穷自动机的转换大家可以参考下谢谢了下了袄-Finite Automata we can change the reference Thank you, the next under a coat
youxianzidongjihuajian
- 有限自动机的确定化及化简 1、更正了 DFA_simplify2 中的错误 2、增加新旧状态对照表 ds_temp --NFA转DFA -- 输入字符 -- 要求 id 必须从 1 开始连续递增-Finite Automata and the identification of a simplification, correction of the errors DFA_simplify2 2, increase the old and new stat
byiyuanli
- 本源码可以用来对确定化的有限自动机进行化简-the source can be used to determine the finite automata for Simplification
Regular-toDFA
- 从正规式到有限自动机及确定的有限自动机的化简。-from the formal ceremony to Finite Automata and the limited automatic machine simplification.
确定型有穷自动机接受的语言的判定
- 用vc 实现的计算理论的基本程序,该程序能判定一个输入的语言能否被有台确定型有穷自动机所接受。-vc used to achieve the theoretical calculation of the basic procedures, the program can determine an input language can be identified with Taiwan-based Finite Automata acceptable.
nfa_dfa
- 求正规表达式到NFA(不确定的有限自动机),NFA到DFA及DFA(有限自动机)的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.
ashfuafnasjf
- 简单的词法分析程序 1)通过理解正规式、有限自动机原理,根据下面的X语言的说明编制一个X语言的词法分析程序。 (2)提交实验报告,报告内容如下: 目的要求、DFA、程序清单(带注释)、测试样例及结果-simple lexical analysis procedure 1) understanding through informal style, Finite Automata Theory, according to the following X-language statement pre
DFA
- DFA,这个一个关于确定有限自动机的算法,有兴趣可以参考一下.-DFA, a set of finite automata algorithms are interested can take a look.
有穷自动机
- 自己编的一个判断浮点数的有限自动机,大家来看看啊-own series of the float of a judge finite automata, we arrives
刘琴-0206-44-自动机的应用
- 本课程设计采用C语言进行编译原理实现课题有限自动机的应用,其目的如下:(1) 理解有限自动机的作用;(2) 利用状态图和状态表表示有限自动机;(3) 以程序实现有限自动机的运行过程-courses designed using the C language compiler principles to achieve automatic machine issues limited the application of its purpose as follows : (a) limited u
77433631694.rar
- 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西。 有限自动机的确定华,NFA到DFA的转变。 ,Is the type that the DFA has recently learned a compiler to produce more of the principle of things. Determination of finite automata China, NFA to DFA transformation.
acsmx
- AC算法----有限自动机的多模式匹配算法.该算法应用有限自动机巧妙地将字符比较转化为了状态转移。-AC algorithms finite automata---- Multi-pattern matching algorithm. The algorithm uses finite automata skilfully converted to state transition character comparison.
reg2NFA
- 这个编译实验把一个正则表达式转化为不确定的有穷自动机NFA算法,有兴趣的朋友可以看看哦。 -The experiment to compile a regular expression into an uncertain finite automata NFA algorithm, interested friends can see Oh.
NFA
- 用C#编写的不确定有穷自动机NFA=>确定有穷自动机DFA的转换算法,-Uncertainty with C#, finite automata NFA => OK finite automaton DFA conversion algorithm
youxian
- 利用状态表和有限自动机的运行原理编制程序,使得程序能够识别一个输入串是否为一个有效的符号串。-The use of state tables and finite automata operating principle of the preparation process, making the procedure to identify whether an input string for an effective symbol string.
1
- 第一部分为有限自动机的构造,第二部分为自动机的比较。-The first part of the structure of finite automata, the second part of the comparison automaton.
An_Dfa
- this code define the deterministic finite automata using genetic programming
An_NFA1
- this code define non-deterministic finite automata using lisp
compile_work2
- 想研究透彻正则表达式,必须知道有穷自动机的原理,这个源码可以给你一个很好的示例参考。编译后程序会生成一个可执行文件,运行这个文件出来一个DOS窗口,然后按提示输入正则表达式。-Wish to research thoroughly regular expressions, you must know the finite automata theory, this source can give you a good example for reference. The compiled pro